Partial Order Games

We introduce a non-cooperative game model in which players’ decision nodes are partially ordered by dependence relation, directly captures informational dependencies the game. In saying that node v is dependent on v1,…,vk, we mean information available to strategy making choice at precisely choices were made v1,…,vk. Although partial order games no more expressive than extensive form of imperfect (we show any can be reduced strategically equivalent information, though possibly cost an exponential blowup size game), they provide natural and compact representation for many strategic settings interest. After introducing model, investigate relationship problem computing Nash equilibria, conditions enable backwards induction this new model.